Blocking Performance Analysis of Fixed-Paths Least-Congestion Routing in Multi ber WDM Networks

Wavelength-routed all-optical networks have been receiving signiicant attention for high-capacity transport applications. A good routing and wavelength assignment (RWA) algorithm is critically important to improve the performance of wavelength-routed WDM networks. We study the blocking performance of xed-paths least-congestion (FPLC) routing in multiiber WDM networks in this paper. A new analytical model based on the link-load correlation is developed to evaluate the blocking performance of the FPLC routing. The analytical model is a generalized model that can be used in both regular (e.g. mesh-torus) and irregular (e.g. NSFnet) networks. It is shown that the analytical results closely match the simulation results, which indicates that the model is adequate in analytically predicting the performance of the FPLC routing in diierent networks. Multiiber WDM networks ooer the advantage of reducing the eeect of the wavelength continuity constraint without using wavelength converters. A wavelength that cannot continue on the next hop on the same ber can be switched to another ber using an optical cross-connect (OXC) if the same wavelength is free on one of the other bers. However, the cost of a multiiber network is likely to be higher than a single-ber network with the same capacity, because more ampliiers and multiplexer/demultiplexer may be required. The design goal of a multiiber network is to achieve high network performance with the minimum number of bers. Two FPLC routing algorithms, wavelength trunk (WT)-based FPLC and lightpath (LP)-based FPLC, are proposed and studied. Our analytical and simulation results show that the LP-based FPLC routing algorithm can use multiple bers more eeciently than the WT-based FPLC and the alternate path routing. In both the mesh-torus and NSFnet networks, limited number of bers is suucient to guarantee high network performance.